An Explicit Control Algorithm for Optical FIFO Queues
نویسندگان
چکیده
With the recent advances in optical technologies, it has become a challenge to build optical queues with minimal complexity. In [2], it was shown that an optical FIFO queue can be constructed recursively by a concatenation of scaled optical memory cells, which in turn are made by 2 × 2 switches and fiber delay lines. However, as the construction is recursive, there is no explicit control algorithm for the 2 × 2 switches in [2]. The main contribution of this paper is to provide an explicit control algorithm for the 2 × 2 switches in that construction. We show that our algorithm has O((logB)) space complexity and time complexity for an optical FIFO queue with buffer B. Key-words: Optical networks, algorithm ∗ IRISA/ENS Cachan (Bretagne), Campus de Ker Lann, 35170 BRUZ, France. Email: [email protected]. † Institute of Communications Engineering, National Tsing-Hua University, Hsinchu 300, Taiwan R.O.C. Email: [email protected]. This research was supported in part by the National Science Council, Taiwan, R.O.C., under Contract NSC-94-2213-E-007-046, and the Program for Promoting Academic Excellence of Universities NSC 94-2752-E-007-002-PAE. Un algorithme de contrôle explicite pour les files d’attentes FIFO optiques Résumé : Avec les avancées récentes dans le domaine des réseaux optiques, chercher à construire des files d’attente optiques de complexité minimale s’annonce prometteur. Dans [2], il a été montré qu’une file d’attente FIFO optique peut être construite de manière récursive par la concaténation de cellules optiques, qui sont constituées de routeurs optiques 2× 2 et de fibres optiques. Mais, comme la construction donnée est récursive, on ne peut pas en déduire directement un algorithme de contrôle des cellules optiques. La principale contribution de ce rapport est de fournir un algorithme de contrôle explicite des cellules. Nous montrons que cet algorithme a une complexité spatiale et temporelle en O((logB)) où B est la capacité de la file d’attente. Mots-clés : Réseaux tout-optique, algorithmes An Explicit Control Algorithm for Optical FIFO Queues 3
منابع مشابه
Constructions of Optical Queues With a Limited Number of Recirculations--Part I: Greedy Constructions
One of the main problems in all-optical packet-switched networks is the lack of optical buffers, and one feasible technology for the constructions of optical buffers is to use optical crossbar Switches and fiber Delay Lines (SDL). In this two-part paper, we consider SDL constructions of optical queues with a limited number of recirculations through the optical switches and the fiber delay lines...
متن کاملFlow Control and Scheduling for Shared FIFO Queues over Wireless Networks
We investigate the performance of First-In, FirstOut (FIFO) queues over wireless networks. We characterize the stability region of a general scenario where an arbitrary number of FIFO queues, which are served by a wireless medium, are shared by an arbitrary number of flows. In general, the stability region of this system is non-convex. Thus, we develop a convex inner-bound on the stability regi...
متن کاملPCP: Efficient Endpoint Congestion Control
In this paper, we present the design, implementation, and evaluation of a novel endpoint congestion control system that achieves near-optimal performance in all likely circumstances. Our approach, called the Probe Control Protocol (PCP), emulates network-based control by using explicit short probes to test and temporarily acquire available bandwidth. Like TCP, PCP requires no network support be...
متن کاملConstructions of Optical Queues With a Limited Number of Recirculations--Part II: Optimal Constructions
One of the main problems in all-optical packet-switched networks is the lack of optical buffers, and one feasible technology for the constructions of optical buffers is to use optical crossbar Switches and fiber Delay Lines (SDL). In this two-part paper, we consider SDL constructions of optical queues with a limited number of recirculations through the optical switches and the fiber delay lines...
متن کاملReal Time Scheduling and Analysis for Can Messages with Offsets
The Controller Area Network (CAN) was designed as a simple, efficient and robust broadcast communications bus for in-vehicle networks; and it has been widely used by automotive manufacturers in recent decades. In the development of CAN system, schedulability analysis theory plays an important role in evaluating whether the system is schedulable or not. This is accomplished by calculating the WC...
متن کامل